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

Theorem nosepdmlem 27571
Description: Lemma for nosepdm 27572. (Contributed by Scott Fenton, 24-Nov-2021.)
Assertion
Ref Expression
nosepdmlem ((𝐴 No 𝐵 No 𝐴 <s 𝐵) → {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ (dom 𝐴 ∪ dom 𝐵))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem nosepdmlem
StepHypRef Expression
1 sltval2 27544 . . . . 5 ((𝐴 No 𝐵 No ) → (𝐴 <s 𝐵 ↔ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)})))
2 fvex 6898 . . . . . . 7 (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ∈ V
3 fvex 6898 . . . . . . 7 (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ∈ V
42, 3brtp 5516 . . . . . 6 ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ↔ (((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)))
5 df-3or 1085 . . . . . . . . . 10 ((((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)) ↔ ((((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)))
6 ndmfv 6920 . . . . . . . . . . . . 13 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐴 → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅)
7 1oex 8477 . . . . . . . . . . . . . . . . . . 19 1o ∈ V
87prid1 4761 . . . . . . . . . . . . . . . . . 18 1o ∈ {1o, 2o}
98nosgnn0i 27547 . . . . . . . . . . . . . . . . 17 ∅ ≠ 1o
10 neeq1 2997 . . . . . . . . . . . . . . . . 17 ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ → ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ 1o ↔ ∅ ≠ 1o))
119, 10mpbiri 258 . . . . . . . . . . . . . . . 16 ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ 1o)
1211neneqd 2939 . . . . . . . . . . . . . . 15 ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ → ¬ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o)
1312intnanrd 489 . . . . . . . . . . . . . 14 ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ → ¬ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅))
1412intnanrd 489 . . . . . . . . . . . . . 14 ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ → ¬ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o))
15 ioran 980 . . . . . . . . . . . . . 14 (¬ (((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)) ↔ (¬ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∧ ¬ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)))
1613, 14, 15sylanbrc 582 . . . . . . . . . . . . 13 ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ → ¬ (((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)))
176, 16syl 17 . . . . . . . . . . . 12 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐴 → ¬ (((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)))
1817adantl 481 . . . . . . . . . . 11 (((𝐴 No 𝐵 No ) ∧ ¬ {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐴) → ¬ (((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)))
19 orel1 885 . . . . . . . . . . 11 (¬ (((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)) → (((((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)) → ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)))
2018, 19syl 17 . . . . . . . . . 10 (((𝐴 No 𝐵 No ) ∧ ¬ {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐴) → (((((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)) → ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)))
215, 20biimtrid 241 . . . . . . . . 9 (((𝐴 No 𝐵 No ) ∧ ¬ {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐴) → ((((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)) → ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)))
22 ndmfv 6920 . . . . . . . . . . . . 13 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐵 → (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅)
23 2on 8481 . . . . . . . . . . . . . . . . 17 2o ∈ On
2423elexi 3488 . . . . . . . . . . . . . . . 16 2o ∈ V
2524prid2 4762 . . . . . . . . . . . . . . 15 2o ∈ {1o, 2o}
2625nosgnn0i 27547 . . . . . . . . . . . . . 14 ∅ ≠ 2o
27 neeq1 2997 . . . . . . . . . . . . . 14 ((𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ → ((𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ 2o ↔ ∅ ≠ 2o))
2826, 27mpbiri 258 . . . . . . . . . . . . 13 ((𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ → (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ 2o)
2922, 28syl 17 . . . . . . . . . . . 12 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐵 → (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ 2o)
3029neneqd 2939 . . . . . . . . . . 11 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐵 → ¬ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)
3130con4i 114 . . . . . . . . . 10 ((𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐵)
3231adantl 481 . . . . . . . . 9 (((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) → {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐵)
3321, 32syl6 35 . . . . . . . 8 (((𝐴 No 𝐵 No ) ∧ ¬ {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐴) → ((((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)) → {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐵))
3433ex 412 . . . . . . 7 ((𝐴 No 𝐵 No ) → (¬ {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐴 → ((((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)) → {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐵)))
3534com23 86 . . . . . 6 ((𝐴 No 𝐵 No ) → ((((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)) → (¬ {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐵)))
364, 35biimtrid 241 . . . . 5 ((𝐴 No 𝐵 No ) → ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) → (¬ {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐵)))
371, 36sylbid 239 . . . 4 ((𝐴 No 𝐵 No ) → (𝐴 <s 𝐵 → (¬ {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐵)))
38373impia 1114 . . 3 ((𝐴 No 𝐵 No 𝐴 <s 𝐵) → (¬ {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐵))
3938orrd 860 . 2 ((𝐴 No 𝐵 No 𝐴 <s 𝐵) → ( {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐵))
40 elun 4143 . 2 ( {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ (dom 𝐴 ∪ dom 𝐵) ↔ ( {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ dom 𝐵))
4139, 40sylibr 233 1 ((𝐴 No 𝐵 No 𝐴 <s 𝐵) → {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} ∈ (dom 𝐴 ∪ dom 𝐵))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  wo 844  w3o 1083  w3a 1084   = wceq 1533  wcel 2098  wne 2934  {crab 3426  cun 3941  c0 4317  {ctp 4627  cop 4629   cint 4943   class class class wbr 5141  dom cdm 5669  Oncon0 6358  cfv 6537  1oc1o 8460  2oc2o 8461   No csur 27528   <s cslt 27529
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697  ax-sep 5292  ax-nul 5299  ax-pr 5420
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2704  df-cleq 2718  df-clel 2804  df-nfc 2879  df-ne 2935  df-ral 3056  df-rex 3065  df-rab 3427  df-v 3470  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-pss 3962  df-nul 4318  df-if 4524  df-pw 4599  df-sn 4624  df-pr 4626  df-tp 4628  df-op 4630  df-uni 4903  df-int 4944  df-br 5142  df-opab 5204  df-tr 5259  df-eprel 5573  df-po 5581  df-so 5582  df-fr 5624  df-we 5626  df-dm 5679  df-ord 6361  df-on 6362  df-suc 6364  df-iota 6489  df-fv 6545  df-1o 8467  df-2o 8468  df-slt 27532
This theorem is referenced by:  nosepdm  27572
  Copyright terms: Public domain W3C validator