Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  nosepnelem Structured version   Visualization version   GIF version

Theorem nosepnelem 33890
Description: Lemma for nosepne 33891. (Contributed by Scott Fenton, 24-Nov-2021.)
Assertion
Ref Expression
nosepnelem ((𝐴 No 𝐵 No 𝐴 <s 𝐵) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem nosepnelem
StepHypRef Expression
1 sltval2 33867 . . 3 ((𝐴 No 𝐵 No ) → (𝐴 <s 𝐵 ↔ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)})))
2 fvex 6779 . . . . 5 (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ∈ V
3 fvex 6779 . . . . 5 (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ∈ V
42, 3brtp 33725 . . . 4 ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ↔ (((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)))
5 1n0 8305 . . . . . 6 1o ≠ ∅
6 simpl 483 . . . . . . 7 (((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o)
7 simpr 485 . . . . . . 7 (((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) → (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅)
86, 7neeq12d 3005 . . . . . 6 (((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) → ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ↔ 1o ≠ ∅))
95, 8mpbiri 257 . . . . 5 (((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}))
10 df-2o 8285 . . . . . . . . . . 11 2o = suc 1o
11 df-1o 8284 . . . . . . . . . . 11 1o = suc ∅
1210, 11eqeq12i 2756 . . . . . . . . . 10 (2o = 1o ↔ suc 1o = suc ∅)
13 1on 8296 . . . . . . . . . . 11 1o ∈ On
14 0elon 6312 . . . . . . . . . . 11 ∅ ∈ On
15 suc11 6362 . . . . . . . . . . 11 ((1o ∈ On ∧ ∅ ∈ On) → (suc 1o = suc ∅ ↔ 1o = ∅))
1613, 14, 15mp2an 689 . . . . . . . . . 10 (suc 1o = suc ∅ ↔ 1o = ∅)
1712, 16bitri 274 . . . . . . . . 9 (2o = 1o ↔ 1o = ∅)
1817necon3bii 2996 . . . . . . . 8 (2o ≠ 1o ↔ 1o ≠ ∅)
195, 18mpbir 230 . . . . . . 7 2o ≠ 1o
2019necomi 2998 . . . . . 6 1o ≠ 2o
21 simpl 483 . . . . . . 7 (((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o)
22 simpr 485 . . . . . . 7 (((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) → (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)
2321, 22neeq12d 3005 . . . . . 6 (((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) → ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ↔ 1o ≠ 2o))
2420, 23mpbiri 257 . . . . 5 (((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}))
25 2on 8298 . . . . . . . . 9 2o ∈ On
2625elexi 3448 . . . . . . . 8 2o ∈ V
2726prid2 4699 . . . . . . 7 2o ∈ {1o, 2o}
2827nosgnn0i 33870 . . . . . 6 ∅ ≠ 2o
29 simpl 483 . . . . . . 7 (((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅)
30 simpr 485 . . . . . . 7 (((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) → (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)
3129, 30neeq12d 3005 . . . . . 6 (((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) → ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ↔ ∅ ≠ 2o))
3228, 31mpbiri 257 . . . . 5 (((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}))
339, 24, 323jaoi 1426 . . . 4 ((((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) ∨ ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}))
344, 33sylbi 216 . . 3 ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}))
351, 34syl6bi 252 . 2 ((𝐴 No 𝐵 No ) → (𝐴 <s 𝐵 → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)})))
36353impia 1116 1 ((𝐴 No 𝐵 No 𝐴 <s 𝐵) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3o 1085  w3a 1086   = wceq 1539  wcel 2106  wne 2943  {crab 3068  c0 4256  {ctp 4565  cop 4567   cint 4879   class class class wbr 5073  Oncon0 6259  suc csuc 6261  cfv 6426  1oc1o 8277  2oc2o 8278   No csur 33851   <s cslt 33852
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5221  ax-nul 5228  ax-pr 5350
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3431  df-dif 3889  df-un 3891  df-in 3893  df-ss 3903  df-pss 3905  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-tp 4566  df-op 4568  df-uni 4840  df-int 4880  df-br 5074  df-opab 5136  df-tr 5191  df-eprel 5490  df-po 5498  df-so 5499  df-fr 5539  df-we 5541  df-ord 6262  df-on 6263  df-suc 6265  df-iota 6384  df-fv 6434  df-1o 8284  df-2o 8285  df-slt 33855
This theorem is referenced by:  nosepne  33891
  Copyright terms: Public domain W3C validator