Theorem elwina 10442

Description: Conditions of weak inaccessibility. (Contributed by Mario Carneiro, 22-Jun-2013.)

Assertion

Ref	Expression
elwina	⊢ (𝐴 ∈ Inaccw ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≺ 𝑦))

Distinct variable group:   𝑥,𝐴,𝑦

Proof of Theorem elwina

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3450	. 2 ⊢ (𝐴 ∈ Inaccw → 𝐴 ∈ V)
2		fvex 6787	. . . 4 ⊢ (cf‘𝐴) ∈ V
3		eleq1 2826	. . . 4 ⊢ ((cf‘𝐴) = 𝐴 → ((cf‘𝐴) ∈ V ↔ 𝐴 ∈ V))
4	2, 3	mpbii 232	. . 3 ⊢ ((cf‘𝐴) = 𝐴 → 𝐴 ∈ V)
5	4	3ad2ant2 1133	. 2 ⊢ ((𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≺ 𝑦) → 𝐴 ∈ V)
6		neeq1 3006	. . . 4 ⊢ (𝑧 = 𝐴 → (𝑧 ≠ ∅ ↔ 𝐴 ≠ ∅))
7		fveq2 6774	. . . . 5 ⊢ (𝑧 = 𝐴 → (cf‘𝑧) = (cf‘𝐴))
8		eqeq12 2755	. . . . 5 ⊢ (((cf‘𝑧) = (cf‘𝐴) ∧ 𝑧 = 𝐴) → ((cf‘𝑧) = 𝑧 ↔ (cf‘𝐴) = 𝐴))
9	7, 8	mpancom 685	. . . 4 ⊢ (𝑧 = 𝐴 → ((cf‘𝑧) = 𝑧 ↔ (cf‘𝐴) = 𝐴))
10		rexeq 3343	. . . . 5 ⊢ (𝑧 = 𝐴 → (∃𝑦 ∈ 𝑧 𝑥 ≺ 𝑦 ↔ ∃𝑦 ∈ 𝐴 𝑥 ≺ 𝑦))
11	10	raleqbi1dv 3340	. . . 4 ⊢ (𝑧 = 𝐴 → (∀𝑥 ∈ 𝑧 ∃𝑦 ∈ 𝑧 𝑥 ≺ 𝑦 ↔ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≺ 𝑦))
12	6, 9, 11	3anbi123d 1435	. . 3 ⊢ (𝑧 = 𝐴 → ((𝑧 ≠ ∅ ∧ (cf‘𝑧) = 𝑧 ∧ ∀𝑥 ∈ 𝑧 ∃𝑦 ∈ 𝑧 𝑥 ≺ 𝑦) ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≺ 𝑦)))
13		df-wina 10440	. . 3 ⊢ Inaccw = {𝑧 ∣ (𝑧 ≠ ∅ ∧ (cf‘𝑧) = 𝑧 ∧ ∀𝑥 ∈ 𝑧 ∃𝑦 ∈ 𝑧 𝑥 ≺ 𝑦)}
14	12, 13	elab2g 3611	. 2 ⊢ (𝐴 ∈ V → (𝐴 ∈ Inaccw ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≺ 𝑦)))
15	1, 5, 14	pm5.21nii 380	1 ⊢ (𝐴 ∈ Inaccw ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≺ 𝑦))

Syntax hints:   ↔ wb 205   ∧ w3a 1086   = wceq 1539   ∈ wcel 2106   ≠ wne 2943  ∀wral 3064  ∃wrex 3065  Vcvv 3432  ∅c0 4256   class class class wbr 5074  ‘cfv 6433   ≺ csdm 8732  cfccf 9695  Inacc_wcwina 10438

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-nul 5230

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  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-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-iota 6391  df-fv 6441  df-wina 10440

This theorem is referenced by:  winaon  10444  inawina  10446  winacard  10448  winainf  10450  winalim2  10452  winafp  10453  gchina  10455