ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  wessep GIF version

Theorem wessep 4682
Description: A subset of a set well-ordered by set membership is well-ordered by set membership. (Contributed by Jim Kingdon, 30-Sep-2021.)
Assertion
Ref Expression
wessep (( E We 𝐴𝐵𝐴) → E We 𝐵)

Proof of Theorem wessep
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ssel 3222 . . . . . . 7 (𝐵𝐴 → (𝑥𝐵𝑥𝐴))
2 ssel 3222 . . . . . . 7 (𝐵𝐴 → (𝑦𝐵𝑦𝐴))
3 ssel 3222 . . . . . . 7 (𝐵𝐴 → (𝑧𝐵𝑧𝐴))
41, 2, 33anim123d 1356 . . . . . 6 (𝐵𝐴 → ((𝑥𝐵𝑦𝐵𝑧𝐵) → (𝑥𝐴𝑦𝐴𝑧𝐴)))
54adantl 277 . . . . 5 (( E We 𝐴𝐵𝐴) → ((𝑥𝐵𝑦𝐵𝑧𝐵) → (𝑥𝐴𝑦𝐴𝑧𝐴)))
65imdistani 445 . . . 4 ((( E We 𝐴𝐵𝐴) ∧ (𝑥𝐵𝑦𝐵𝑧𝐵)) → (( E We 𝐴𝐵𝐴) ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)))
7 wetrep 4463 . . . . . 6 (( E We 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑥𝑦𝑦𝑧) → 𝑥𝑧))
87adantlr 477 . . . . 5 ((( E We 𝐴𝐵𝐴) ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑥𝑦𝑦𝑧) → 𝑥𝑧))
9 epel 4395 . . . . . 6 (𝑥 E 𝑦𝑥𝑦)
10 epel 4395 . . . . . 6 (𝑦 E 𝑧𝑦𝑧)
119, 10anbi12i 460 . . . . 5 ((𝑥 E 𝑦𝑦 E 𝑧) ↔ (𝑥𝑦𝑦𝑧))
12 epel 4395 . . . . 5 (𝑥 E 𝑧𝑥𝑧)
138, 11, 123imtr4g 205 . . . 4 ((( E We 𝐴𝐵𝐴) ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑥 E 𝑦𝑦 E 𝑧) → 𝑥 E 𝑧))
146, 13syl 14 . . 3 ((( E We 𝐴𝐵𝐴) ∧ (𝑥𝐵𝑦𝐵𝑧𝐵)) → ((𝑥 E 𝑦𝑦 E 𝑧) → 𝑥 E 𝑧))
1514ralrimivvva 2616 . 2 (( E We 𝐴𝐵𝐴) → ∀𝑥𝐵𝑦𝐵𝑧𝐵 ((𝑥 E 𝑦𝑦 E 𝑧) → 𝑥 E 𝑧))
16 zfregfr 4678 . . 3 E Fr 𝐵
17 df-wetr 4437 . . 3 ( E We 𝐵 ↔ ( E Fr 𝐵 ∧ ∀𝑥𝐵𝑦𝐵𝑧𝐵 ((𝑥 E 𝑦𝑦 E 𝑧) → 𝑥 E 𝑧)))
1816, 17mpbiran 949 . 2 ( E We 𝐵 ↔ ∀𝑥𝐵𝑦𝐵𝑧𝐵 ((𝑥 E 𝑦𝑦 E 𝑧) → 𝑥 E 𝑧))
1915, 18sylibr 134 1 (( E We 𝐴𝐵𝐴) → E We 𝐵)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1005  wcel 2202  wral 2511  wss 3201   class class class wbr 4093   E cep 4390   Fr wfr 4431   We wwe 4433
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-setind 4641
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-br 4094  df-opab 4156  df-eprel 4392  df-frfor 4434  df-frind 4435  df-wetr 4437
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator