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

Theorem noinfbday 27672
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 27670 . . . 4 ((𝐵 No 𝐵𝑉) → 𝑇 No )
3 bdayval 27600 . . . 4 (𝑇 No → ( bday 𝑇) = dom 𝑇)
42, 3syl 17 . . 3 ((𝐵 No 𝐵𝑉) → ( bday 𝑇) = dom 𝑇)
54adantr 480 . 2 (((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) → ( bday 𝑇) = dom 𝑇)
6 iftrue 4462 . . . . . . . 8 (∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 → if(∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥, ((𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢𝐵 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣𝐵𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥𝑢𝐵 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣𝐵𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢𝑔) = 𝑥)))) = ((𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}))
71, 6eqtrid 2782 . . . . . . 7 (∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥𝑇 = ((𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}))
87dmeqd 5849 . . . . . 6 (∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 → dom 𝑇 = dom ((𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}))
9 1oex 8404 . . . . . . . . 9 1o ∈ V
109dmsnop 6169 . . . . . . . 8 dom {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩} = {dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)}
1110uneq2i 4097 . . . . . . 7 (dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ dom {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}) = (dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)})
12 dmun 5854 . . . . . . 7 dom ((𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}) = (dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ dom {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩})
13 df-suc 6318 . . . . . . 7 suc dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) = (dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)})
1411, 12, 133eqtr4i 2768 . . . . . 6 dom ((𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}) = suc dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)
158, 14eqtrdi 2786 . . . . 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 6322 . . . . . 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 27651 . . . . . . . . . . 11 (𝐵 No → ∃*𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)
2320, 22syl 17 . . . . . . . . . 10 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → ∃*𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)
24 reu5 3342 . . . . . . . . . 10 (∃!𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ↔ (∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ∃*𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥))
2521, 23, 24sylanbrc 584 . . . . . . . . 9 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → ∃!𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)
26 riotacl 7330 . . . . . . . . 9 (∃!𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 → (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∈ 𝐵)
2725, 26syl 17 . . . . . . . 8 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∈ 𝐵)
2820, 27sseldd 3918 . . . . . . 7 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∈ No )
29 bdayval 27600 . . . . . . 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 27629 . . . . . . . . 9 bday : No onto→On
33 fofn 6743 . . . . . . . . 9 ( bday : No onto→On → bday Fn No )
3432, 33ax-mp 5 . . . . . . . 8 bday Fn No
35 fnfvima 7177 . . . . . . . 8 (( bday Fn No 𝐵 No ∧ (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∈ 𝐵) → ( bday ‘(𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)) ∈ ( bday 𝐵))
3634, 20, 27, 35mp3an2i 1469 . . . . . . 7 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → ( bday ‘(𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)) ∈ ( bday 𝐵))
3731, 36sseldd 3918 . . . . . 6 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → ( bday ‘(𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)) ∈ 𝑂)
3830, 37eqeltrrd 2836 . . . . 5 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∈ 𝑂)
39 ordsucss 7758 . . . . 5 (Ord 𝑂 → (dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∈ 𝑂 → suc dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ⊆ 𝑂))
4019, 38, 39sylc 65 . . . 4 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → suc dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ⊆ 𝑂)
4116, 40eqsstrd 3951 . . 3 ((∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → dom 𝑇𝑂)
421noinfdm 27671 . . . . 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 3912 . . . . . . . . . . . . 13 ((𝐵 No 𝑝𝐵) → 𝑝 No )
4746ad4ant14 753 . . . . . . . . . . . 12 ((((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) ∧ 𝑝𝐵) → 𝑝 No )
48 bdayval 27600 . . . . . . . . . . . 12 (𝑝 No → ( bday 𝑝) = dom 𝑝)
4947, 48syl 17 . . . . . . . . . . 11 ((((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) ∧ 𝑝𝐵) → ( bday 𝑝) = dom 𝑝)
50 simplrr 778 . . . . . . . . . . . 12 ((((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) ∧ 𝑝𝐵) → ( bday 𝐵) ⊆ 𝑂)
51 fnfvima 7177 . . . . . . . . . . . . . 14 (( bday Fn No 𝐵 No 𝑝𝐵) → ( bday 𝑝) ∈ ( bday 𝐵))
5234, 51mp3an1 1451 . . . . . . . . . . . . 13 ((𝐵 No 𝑝𝐵) → ( bday 𝑝) ∈ ( bday 𝐵))
5352ad4ant14 753 . . . . . . . . . . . 12 ((((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) ∧ 𝑝𝐵) → ( bday 𝑝) ∈ ( bday 𝐵))
5450, 53sseldd 3918 . . . . . . . . . . 11 ((((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) ∧ 𝑝𝐵) → ( bday 𝑝) ∈ 𝑂)
5549, 54eqeltrrd 2836 . . . . . . . . . 10 ((((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) ∧ 𝑝𝐵) → dom 𝑝𝑂)
56 ordelss 6328 . . . . . . . . . 10 ((Ord 𝑂 ∧ dom 𝑝𝑂) → dom 𝑝𝑂)
5745, 55, 56syl2anc 585 . . . . . . . . 9 ((((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) ∧ 𝑝𝐵) → dom 𝑝𝑂)
5857sseld 3916 . . . . . . . 8 ((((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) ∧ 𝑝𝐵) → (𝑧 ∈ dom 𝑝𝑧𝑂))
5958adantrd 491 . . . . . . 7 ((((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) ∧ 𝑝𝐵) → ((𝑧 ∈ dom 𝑝 ∧ ∀𝑞𝐵𝑝 <s 𝑞 → (𝑝 ↾ suc 𝑧) = (𝑞 ↾ suc 𝑧))) → 𝑧𝑂))
6059rexlimdva 3136 . . . . . 6 (((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) → (∃𝑝𝐵 (𝑧 ∈ dom 𝑝 ∧ ∀𝑞𝐵𝑝 <s 𝑞 → (𝑝 ↾ suc 𝑧) = (𝑞 ↾ suc 𝑧))) → 𝑧𝑂))
6160abssdv 4000 . . . . 5 (((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) → {𝑧 ∣ ∃𝑝𝐵 (𝑧 ∈ dom 𝑝 ∧ ∀𝑞𝐵𝑝 <s 𝑞 → (𝑝 ↾ suc 𝑧) = (𝑞 ↾ suc 𝑧)))} ⊆ 𝑂)
6261adantl 481 . . . 4 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → {𝑧 ∣ ∃𝑝𝐵 (𝑧 ∈ dom 𝑝 ∧ ∀𝑞𝐵𝑝 <s 𝑞 → (𝑝 ↾ suc 𝑧) = (𝑞 ↾ suc 𝑧)))} ⊆ 𝑂)
6343, 62eqsstrd 3951 . . 3 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ ((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂))) → dom 𝑇𝑂)
6441, 63pm2.61ian 812 . 2 (((𝐵 No 𝐵𝑉) ∧ (𝑂 ∈ On ∧ ( bday 𝐵) ⊆ 𝑂)) → dom 𝑇𝑂)
655, 64eqsstrd 3951 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 2713  wral 3049  wrex 3059  ∃!wreu 3338  ∃*wrmo 3339  cun 3883  wss 3885  ifcif 4456  {csn 4557  cop 4563   class class class wbr 5074  cmpt 5155  dom cdm 5620  cres 5622  cima 5623  Ord word 6311  Oncon0 6312  suc csuc 6314  cio 6441   Fn wfn 6482  ontowfo 6485  cfv 6487  crio 7312  1oc1o 8387   No csur 27591   <s clts 27592   bday cbday 27593
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 2184  ax-ext 2707  ax-rep 5201  ax-sep 5220  ax-nul 5230  ax-pow 5296  ax-pr 5364  ax-un 7678
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 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2931  df-ral 3050  df-rex 3060  df-rmo 3340  df-reu 3341  df-rab 3388  df-v 3429  df-sbc 3726  df-csb 3834  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-pss 3905  df-nul 4264  df-if 4457  df-pw 4533  df-sn 4558  df-pr 4560  df-tp 4562  df-op 4564  df-uni 4841  df-br 5075  df-opab 5137  df-mpt 5156  df-tr 5182  df-id 5515  df-eprel 5520  df-po 5528  df-so 5529  df-fr 5573  df-we 5575  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-res 5632  df-ima 5633  df-ord 6315  df-on 6316  df-suc 6318  df-iota 6443  df-fun 6489  df-fn 6490  df-f 6491  df-fo 6493  df-fv 6495  df-riota 7313  df-1o 8394  df-2o 8395  df-no 27594  df-lts 27595  df-bday 27596
This theorem is referenced by:  noetalem1  27693
  Copyright terms: Public domain W3C validator