MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  noinfbday Structured version   Visualization version   GIF version

Theorem noinfbday 27692
Description: Birthday bounding law for surreal infimum. (Contributed by Scott Fenton, 8-Aug-2024.)
Hypothesis
Ref Expression
noinfbday.1 𝑇 = if(∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥, ((𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢𝐵 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣𝐵𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥𝑢𝐵 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣𝐵𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢𝑔) = 𝑥))))
Assertion
Ref Expression
noinfbday (((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) → ( bday 𝑇) ⊆ 𝑂)
Distinct variable groups:   𝐵,𝑔,𝑢,𝑣,𝑥,𝑦   𝑔,𝑉
Allowed substitution hints:   𝑇(𝑥,𝑦,𝑣,𝑢,𝑔)   𝑂(𝑥,𝑦,𝑣,𝑢,𝑔)   𝑉(𝑥,𝑦,𝑣,𝑢)

Proof of Theorem noinfbday
Dummy variables 𝑝 𝑧 𝑞 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 noinfbday.1 . . . . 5 𝑇 = if(∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥, ((𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢𝐵 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣𝐵𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥𝑢𝐵 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣𝐵𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢𝑔) = 𝑥))))
21noinfno 27690 . . . 4 ((𝐵 No 𝐵𝑉) → 𝑇 No )
3 bdayval 27620 . . . 4 (𝑇 No → ( bday 𝑇) = dom 𝑇)
42, 3syl 17 . . 3 ((𝐵 No 𝐵𝑉) → ( bday 𝑇) = dom 𝑇)
54adantr 480 . 2 (((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) → ( bday 𝑇) = dom 𝑇)
6 iftrue 4486 . . . . . . . 8 (∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 → if(∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥, ((𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢𝐵 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣𝐵𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥𝑢𝐵 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣𝐵𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢𝑔) = 𝑥)))) = ((𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}))
71, 6eqtrid 2784 . . . . . . 7 (∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥𝑇 = ((𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}))
87dmeqd 5855 . . . . . 6 (∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 → dom 𝑇 = dom ((𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}))
9 1oex 8409 . . . . . . . . 9 1o ∈ V
109dmsnop 6175 . . . . . . . 8 dom {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩} = {dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)}
1110uneq2i 4118 . . . . . . 7 (dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ dom {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}) = (dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)})
12 dmun 5860 . . . . . . 7 dom ((𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}) = (dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ dom {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩})
13 df-suc 6324 . . . . . . 7 suc dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) = (dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)})
1411, 12, 133eqtr4i 2770 . . . . . 6 dom ((𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}) = suc dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)
158, 14eqtrdi 2788 . . . . 5 (∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 → dom 𝑇 = suc dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥))
1615adantr 480 . . . 4 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → dom 𝑇 = suc dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥))
17 simprrl 781 . . . . . 6 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → 𝑂 ∈ On)
18 eloni 6328 . . . . . 6 (𝑂 ∈ On → Ord 𝑂)
1917, 18syl 17 . . . . 5 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → Ord 𝑂)
20 simprll 779 . . . . . . . 8 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → 𝐵 No )
21 simpl 482 . . . . . . . . . 10 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)
22 nominmo 27671 . . . . . . . . . . 11 (𝐵 No → ∃*𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)
2320, 22syl 17 . . . . . . . . . 10 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → ∃*𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)
24 reu5 3353 . . . . . . . . . 10 (∃!𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ↔ (∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ∃*𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥))
2521, 23, 24sylanbrc 584 . . . . . . . . 9 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → ∃!𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)
26 riotacl 7334 . . . . . . . . 9 (∃!𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 → (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∈ 𝐵)
2725, 26syl 17 . . . . . . . 8 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∈ 𝐵)
2820, 27sseldd 3935 . . . . . . 7 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∈ No )
29 bdayval 27620 . . . . . . 7 ((𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∈ No → ( bday ‘(𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)) = dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥))
3028, 29syl 17 . . . . . 6 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → ( bday ‘(𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)) = dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥))
31 simprrr 782 . . . . . . 7 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → ( bday 𝐵) ⊆ 𝑂)
32 bdayfo 27649 . . . . . . . . 9 bday : No onto→On
33 fofn 6749 . . . . . . . . 9 ( bday : No onto→On → bday Fn No )
3432, 33ax-mp 5 . . . . . . . 8 bday Fn No
35 fnfvima 7181 . . . . . . . 8 (( bday Fn No 𝐵 No ∧ (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∈ 𝐵) → ( bday ‘(𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)) ∈ ( bday 𝐵))
3634, 20, 27, 35mp3an2i 1469 . . . . . . 7 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → ( bday ‘(𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)) ∈ ( bday 𝐵))
3731, 36sseldd 3935 . . . . . 6 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → ( bday ‘(𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)) ∈ 𝑂)
3830, 37eqeltrrd 2838 . . . . 5 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∈ 𝑂)
39 ordsucss 7762 . . . . 5 (Ord 𝑂 → (dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∈ 𝑂 → suc dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ⊆ 𝑂))
4019, 38, 39sylc 65 . . . 4 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → suc dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ⊆ 𝑂)
4116, 40eqsstrd 3969 . . 3 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → dom 𝑇𝑂)
421noinfdm 27691 . . . . 5 (¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 → dom 𝑇 = {𝑧 ∣ ∃𝑝𝐵 (𝑧 ∈ dom 𝑝 ∧ ∀𝑞𝐵𝑝 <s 𝑞 → (𝑝 ↾ suc 𝑧) = (𝑞 ↾ suc 𝑧)))})
4342adantr 480 . . . 4 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → dom 𝑇 = {𝑧 ∣ ∃𝑝𝐵 (𝑧 ∈ dom 𝑝 ∧ ∀𝑞𝐵𝑝 <s 𝑞 → (𝑝 ↾ suc 𝑧) = (𝑞 ↾ suc 𝑧)))})
44 simplrl 777 . . . . . . . . . . 11 ((((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) ∧ 𝑝𝐵) → 𝑂 ∈ On)
4544, 18syl 17 . . . . . . . . . 10 ((((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) ∧ 𝑝𝐵) → Ord 𝑂)
46 ssel2 3929 . . . . . . . . . . . . 13 ((𝐵 No 𝑝𝐵) → 𝑝 No )
4746ad4ant14 753 . . . . . . . . . . . 12 ((((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) ∧ 𝑝𝐵) → 𝑝 No )
48 bdayval 27620 . . . . . . . . . . . 12 (𝑝 No → ( bday 𝑝) = dom 𝑝)
4947, 48syl 17 . . . . . . . . . . 11 ((((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) ∧ 𝑝𝐵) → ( bday 𝑝) = dom 𝑝)
50 simplrr 778 . . . . . . . . . . . 12 ((((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) ∧ 𝑝𝐵) → ( bday 𝐵) ⊆ 𝑂)
51 fnfvima 7181 . . . . . . . . . . . . . 14 (( bday Fn No 𝐵 No 𝑝𝐵) → ( bday 𝑝) ∈ ( bday 𝐵))
5234, 51mp3an1 1451 . . . . . . . . . . . . 13 ((𝐵 No 𝑝𝐵) → ( bday 𝑝) ∈ ( bday 𝐵))
5352ad4ant14 753 . . . . . . . . . . . 12 ((((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) ∧ 𝑝𝐵) → ( bday 𝑝) ∈ ( bday 𝐵))
5450, 53sseldd 3935 . . . . . . . . . . 11 ((((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) ∧ 𝑝𝐵) → ( bday 𝑝) ∈ 𝑂)
5549, 54eqeltrrd 2838 . . . . . . . . . 10 ((((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) ∧ 𝑝𝐵) → dom 𝑝𝑂)
56 ordelss 6334 . . . . . . . . . 10 ((Ord 𝑂 ∧ dom 𝑝𝑂) → dom 𝑝𝑂)
5745, 55, 56syl2anc 585 . . . . . . . . 9 ((((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) ∧ 𝑝𝐵) → dom 𝑝𝑂)
5857sseld 3933 . . . . . . . 8 ((((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) ∧ 𝑝𝐵) → (𝑧 ∈ dom 𝑝𝑧𝑂))
5958adantrd 491 . . . . . . 7 ((((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) ∧ 𝑝𝐵) → ((𝑧 ∈ dom 𝑝 ∧ ∀𝑞𝐵𝑝 <s 𝑞 → (𝑝 ↾ suc 𝑧) = (𝑞 ↾ suc 𝑧))) → 𝑧𝑂))
6059rexlimdva 3138 . . . . . 6 (((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) → (∃𝑝𝐵 (𝑧 ∈ dom 𝑝 ∧ ∀𝑞𝐵𝑝 <s 𝑞 → (𝑝 ↾ suc 𝑧) = (𝑞 ↾ suc 𝑧))) → 𝑧𝑂))
6160abssdv 4020 . . . . 5 (((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) → {𝑧 ∣ ∃𝑝𝐵 (𝑧 ∈ dom 𝑝 ∧ ∀𝑞𝐵𝑝 <s 𝑞 → (𝑝 ↾ suc 𝑧) = (𝑞 ↾ suc 𝑧)))} ⊆ 𝑂)
6261adantl 481 . . . 4 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → {𝑧 ∣ ∃𝑝𝐵 (𝑧 ∈ dom 𝑝 ∧ ∀𝑞𝐵𝑝 <s 𝑞 → (𝑝 ↾ suc 𝑧) = (𝑞 ↾ suc 𝑧)))} ⊆ 𝑂)
6343, 62eqsstrd 3969 . . 3 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → dom 𝑇𝑂)
6441, 63pm2.61ian 812 . 2 (((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) → dom 𝑇𝑂)
655, 64eqsstrd 3969 1 (((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) → ( bday 𝑇) ⊆ 𝑂)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  w3a 1087   = wceq 1542  wcel 2114  {cab 2715  wral 3052  wrex 3061  ∃!wreu 3349  ∃*wrmo 3350  cun 3900  wss 3902  ifcif 4480  {csn 4581  cop 4587   class class class wbr 5099  cmpt 5180  dom cdm 5625  cres 5627  cima 5628  Ord word 6317  Oncon0 6318  suc csuc 6320  cio 6447   Fn wfn 6488  ontowfo 6491  cfv 6493  crio 7316  1oc1o 8392   No csur 27611   <s clts 27612   bday cbday 27613
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7682
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rmo 3351  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-tp 4586  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-ord 6321  df-on 6322  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-fo 6499  df-fv 6501  df-riota 7317  df-1o 8399  df-2o 8400  df-no 27614  df-lts 27615  df-bday 27616
This theorem is referenced by:  noetalem1  27713
  Copyright terms: Public domain W3C validator