Theorem sltval 31044

Description: The value of the surreal less than relationship. (Contributed by Scott Fenton, 14-Jun-2011.)

Assertion

Ref	Expression
sltval	⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (𝐴 <s 𝐵 ↔ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦) ∧ (𝐴‘𝑥){⟨1𝑜, ∅⟩, ⟨1𝑜, 2𝑜⟩, ⟨∅, 2𝑜⟩} (𝐵‘𝑥))))

Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦

Proof of Theorem sltval

Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1 2676	. . . . 5 ⊢ (𝑓 = 𝐴 → (𝑓 ∈ No ↔ 𝐴 ∈ No ))
2	1	anbi1d 737	. . . 4 ⊢ (𝑓 = 𝐴 → ((𝑓 ∈ No ∧ 𝑔 ∈ No ) ↔ (𝐴 ∈ No ∧ 𝑔 ∈ No )))
3		fveq1 6102	. . . . . . . 8 ⊢ (𝑓 = 𝐴 → (𝑓‘𝑦) = (𝐴‘𝑦))
4	3	eqeq1d 2612	. . . . . . 7 ⊢ (𝑓 = 𝐴 → ((𝑓‘𝑦) = (𝑔‘𝑦) ↔ (𝐴‘𝑦) = (𝑔‘𝑦)))
5	4	ralbidv 2969	. . . . . 6 ⊢ (𝑓 = 𝐴 → (∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑔‘𝑦) ↔ ∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝑔‘𝑦)))
6		fveq1 6102	. . . . . . 7 ⊢ (𝑓 = 𝐴 → (𝑓‘𝑥) = (𝐴‘𝑥))
7	6	breq1d 4593	. . . . . 6 ⊢ (𝑓 = 𝐴 → ((𝑓‘𝑥){⟨1𝑜, ∅⟩, ⟨1𝑜, 2𝑜⟩, ⟨∅, 2𝑜⟩} (𝑔‘𝑥) ↔ (𝐴‘𝑥){⟨1𝑜, ∅⟩, ⟨1𝑜, 2𝑜⟩, ⟨∅, 2𝑜⟩} (𝑔‘𝑥)))
8	5, 7	anbi12d 743	. . . . 5 ⊢ (𝑓 = 𝐴 → ((∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑔‘𝑦) ∧ (𝑓‘𝑥){⟨1𝑜, ∅⟩, ⟨1𝑜, 2𝑜⟩, ⟨∅, 2𝑜⟩} (𝑔‘𝑥)) ↔ (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝑔‘𝑦) ∧ (𝐴‘𝑥){⟨1𝑜, ∅⟩, ⟨1𝑜, 2𝑜⟩, ⟨∅, 2𝑜⟩} (𝑔‘𝑥))))
9	8	rexbidv 3034	. . . 4 ⊢ (𝑓 = 𝐴 → (∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑔‘𝑦) ∧ (𝑓‘𝑥){⟨1𝑜, ∅⟩, ⟨1𝑜, 2𝑜⟩, ⟨∅, 2𝑜⟩} (𝑔‘𝑥)) ↔ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝑔‘𝑦) ∧ (𝐴‘𝑥){⟨1𝑜, ∅⟩, ⟨1𝑜, 2𝑜⟩, ⟨∅, 2𝑜⟩} (𝑔‘𝑥))))
10	2, 9	anbi12d 743	. . 3 ⊢ (𝑓 = 𝐴 → (((𝑓 ∈ No ∧ 𝑔 ∈ No ) ∧ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑔‘𝑦) ∧ (𝑓‘𝑥){⟨1𝑜, ∅⟩, ⟨1𝑜, 2𝑜⟩, ⟨∅, 2𝑜⟩} (𝑔‘𝑥))) ↔ ((𝐴 ∈ No ∧ 𝑔 ∈ No ) ∧ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝑔‘𝑦) ∧ (𝐴‘𝑥){⟨1𝑜, ∅⟩, ⟨1𝑜, 2𝑜⟩, ⟨∅, 2𝑜⟩} (𝑔‘𝑥)))))
11		eleq1 2676	. . . . 5 ⊢ (𝑔 = 𝐵 → (𝑔 ∈ No ↔ 𝐵 ∈ No ))
12	11	anbi2d 736	. . . 4 ⊢ (𝑔 = 𝐵 → ((𝐴 ∈ No ∧ 𝑔 ∈ No ) ↔ (𝐴 ∈ No ∧ 𝐵 ∈ No )))
13		fveq1 6102	. . . . . . . 8 ⊢ (𝑔 = 𝐵 → (𝑔‘𝑦) = (𝐵‘𝑦))
14	13	eqeq2d 2620	. . . . . . 7 ⊢ (𝑔 = 𝐵 → ((𝐴‘𝑦) = (𝑔‘𝑦) ↔ (𝐴‘𝑦) = (𝐵‘𝑦)))
15	14	ralbidv 2969	. . . . . 6 ⊢ (𝑔 = 𝐵 → (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝑔‘𝑦) ↔ ∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦)))
16		fveq1 6102	. . . . . . 7 ⊢ (𝑔 = 𝐵 → (𝑔‘𝑥) = (𝐵‘𝑥))
17	16	breq2d 4595	. . . . . 6 ⊢ (𝑔 = 𝐵 → ((𝐴‘𝑥){⟨1𝑜, ∅⟩, ⟨1𝑜, 2𝑜⟩, ⟨∅, 2𝑜⟩} (𝑔‘𝑥) ↔ (𝐴‘𝑥){⟨1𝑜, ∅⟩, ⟨1𝑜, 2𝑜⟩, ⟨∅, 2𝑜⟩} (𝐵‘𝑥)))
18	15, 17	anbi12d 743	. . . . 5 ⊢ (𝑔 = 𝐵 → ((∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝑔‘𝑦) ∧ (𝐴‘𝑥){⟨1𝑜, ∅⟩, ⟨1𝑜, 2𝑜⟩, ⟨∅, 2𝑜⟩} (𝑔‘𝑥)) ↔ (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦) ∧ (𝐴‘𝑥){⟨1𝑜, ∅⟩, ⟨1𝑜, 2𝑜⟩, ⟨∅, 2𝑜⟩} (𝐵‘𝑥))))
19	18	rexbidv 3034	. . . 4 ⊢ (𝑔 = 𝐵 → (∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝑔‘𝑦) ∧ (𝐴‘𝑥){⟨1𝑜, ∅⟩, ⟨1𝑜, 2𝑜⟩, ⟨∅, 2𝑜⟩} (𝑔‘𝑥)) ↔ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦) ∧ (𝐴‘𝑥){⟨1𝑜, ∅⟩, ⟨1𝑜, 2𝑜⟩, ⟨∅, 2𝑜⟩} (𝐵‘𝑥))))
20	12, 19	anbi12d 743	. . 3 ⊢ (𝑔 = 𝐵 → (((𝐴 ∈ No ∧ 𝑔 ∈ No ) ∧ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝑔‘𝑦) ∧ (𝐴‘𝑥){⟨1𝑜, ∅⟩, ⟨1𝑜, 2𝑜⟩, ⟨∅, 2𝑜⟩} (𝑔‘𝑥))) ↔ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦) ∧ (𝐴‘𝑥){⟨1𝑜, ∅⟩, ⟨1𝑜, 2𝑜⟩, ⟨∅, 2𝑜⟩} (𝐵‘𝑥)))))
21		df-slt 31041	. . 3 ⊢ <s = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ No ∧ 𝑔 ∈ No ) ∧ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑔‘𝑦) ∧ (𝑓‘𝑥){⟨1𝑜, ∅⟩, ⟨1𝑜, 2𝑜⟩, ⟨∅, 2𝑜⟩} (𝑔‘𝑥)))}
22	10, 20, 21	brabg 4919	. 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (𝐴 <s 𝐵 ↔ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦) ∧ (𝐴‘𝑥){⟨1𝑜, ∅⟩, ⟨1𝑜, 2𝑜⟩, ⟨∅, 2𝑜⟩} (𝐵‘𝑥)))))
23	22	bianabs 920	1 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (𝐴 <s 𝐵 ↔ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦) ∧ (𝐴‘𝑥){⟨1𝑜, ∅⟩, ⟨1𝑜, 2𝑜⟩, ⟨∅, 2𝑜⟩} (𝐵‘𝑥))))

Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   = wceq 1475   ∈ wcel 1977  ∀wral 2896  ∃wrex 2897  ∅c0 3874  {ctp 4129  ⟨cop 4131   class class class wbr 4583  Oncon0 5640  ‘cfv 5804  1_𝑜c1o 7440  2_𝑜c2o 7441   No csur 31037   <s cslt 31038

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-iota 5768  df-fv 5812  df-slt 31041

This theorem is referenced by:  sltval2  31053  sltres  31061  nodense  31088  nobndup  31099  nobnddown  31100